A Complete Axiomatization for Reduced Clock Constraint Specification Language
نویسندگان
چکیده
Clock Constraint Specification Language, or CCSL, is a domainspecific language designed to model distributed real-time systems in terms of logical time, that is of sequences of events. Typical application of CCSL is to serve as a specification language for verification of specified systems. In this paper we provide a sound and complete axiomatic for propositional logic over large fragment of CCSL which we call reduced CCSL, or RCCSL. This axiomatics appears to be rather simple, thus enabling effective verification of RCCSL specifications.
منابع مشابه
First-Order Logic with Dependent Types
We present DFOL, an extension of classical first-order logic with dependent types, i.e., as in Martin-Löf type theory, signatures may contain type-valued function symbols. A model theory for the logic is given that stays close to the established first-order model theory. The logic is presented as an institution, and the logical framework LF is used to define signatures, terms and formulas. We s...
متن کاملA Complete Axiomatization of Strict Equality over Infinite Trees (Extended Version) Technical Report SIC-03-2009, UCM
Computing with data values that are some kind of trees — finite, infinite, rational— is at the core of declarative programming, either logic, functional or functional-logic. Understanding the logic of trees is therefore a fundamental question with impact in different aspects, like language design, including constraint systems or constructive negation, or obtaining methods for verifying and reas...
متن کاملTableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
Propositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. This extended abstract sketches a tableau-like axiomatization for PLTL based on automata-theoretic decision procedure coupled with tableau for local model checking of the propositional μ-Calculus. Propositional Linear Temporal Logic (PLTL) is a very popular...
متن کاملTowards a Transformation Approach of Timed UML MARTE Specifications for Observer-Based Formal Verification
Modeling timing constraints of distributed systems and multi-clock electronic systems aims to describe different time requirements aspects at a higher abstraction level. An important aspect is the logical time of the behavior of these systems. To model the time requirements, a specification language with multiple clock domains called Clock Constraint Specification Language (CCSL) has been intro...
متن کاملUML Profile for MARTE: Time Model and CCSL
This 90 minutes tutorial gives a basic introduction to the UML Profile for MARTE (Modeling and Analysis of Real-Time and Embedded systems) adopted by the Object Management Group. After a brief introduction to the UML profiling mechanism, we give a broad overview of the MARTE Profile. Then, the tutorial shall focus on the time model of MARTE and its companion language CCSL (Clock Constraint Spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016